Recursive sum–product algorithm for generalized outer-planar graphs
نویسندگان
چکیده
منابع مشابه
Recursive sum-product algorithm for generalized outer-planar graphs
Article history: Received 26 June 2011 Received in revised form 1 March 2012 Accepted 2 March 2012 Available online 6 March 2012 Communicated by J. Torán
متن کاملObstruction Sets for Outer-Projective-Planar Graphs
A graph G is outer projective planar if it can be embedded in the projective plane so that every vertex appears on the boundary of a single face We exhibit obstruction sets for outer projective planar graphs with respect to the subdivision minor and Y orderings Equivalently we nd the minimal non outer projective planar graphs under these orderings
متن کاملGeneralized Dalaunay Triangualtion for Planar Graphs
We introduce the notion of generalized Delaunay triangulation of a planar straight-line graph G = (V, E) in the Euclidean plane and present some characterizations of the triangulation. It is shown that the generalized Delaunay triangulation has the property that the minimum angle of the triangles in the triangulation is maximum among all possible triangulations of the graph. A general algorithm...
متن کاملRecursive Generation of 5-Regular Planar Graphs
We describe for the first time how the 5-regular simple planar graphs can all be obtained from a simple family of starting graphs by repeatedly applying a few expansion operations. The proof uses an innovative amalgam of theory and computation. By incorporating the recursion into the canonical construction path method of isomorph rejection, a generator of non-isomorphic 5-regular planar graphs ...
متن کاملA simple algorithm for multicuts in planar graphs with outer terminals
Given an edge-weighted graph G and a list of source-sink pairs of terminal vertices of G, the minimum multicut problem consists in selecting a minimum weight set of edges of G whose removal leaves no path from the ith source to the ith sink, for each i. Few tractable special cases are known for this problem. In this paper, we give a simple polynomial-time algorithm solving it in undirected plan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2012
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2012.03.001